package 强化训练;

import java.util.Scanner;

public class day39最长公共子序列 {
    public static void main(String[] agrs){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            String s1 = sc.next();
            String s2 = sc.next();
            int len1 = s1.length();
            int len2 = s2.length();
            int[][] dp = new int[len1+1][len2+1];
            //1,初始化容器
            //2,填表
            for (int i = 1; i < len1+1; i++) {
                for (int j = 1; j < len2+1; j++) {
                    if (s1.charAt(i-1) == s2.charAt(j-1)){
                        dp[i][j] = dp[i-1][j-1] + 1;
                    }else {
                        dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
                    }
                }
            }
            //3.返回
            System.out.println(dp[len1][len2]);
        }
    }
}
